Multi Agent Based Congestion Control in VANETs
نویسندگان
چکیده
منابع مشابه
Congestion Control Algorithm In Vanets
A Vehicular Ad-Hoc Networks (VANETs) are technology that uses moving cars as nodes in a network to create a mobile network. VANET turns every participating car into a wireless router, allowing cars of each other to connect and create a network with a wide range. VANETs are developed for enhancing the driving safety and comfort of automotive users. The VANETs can provide wide variety of services...
متن کاملMulti-agent System Approach for Congestion Control in Atm Networks
The Broadband Integrated Services Digital Network (B-ISDN) supports transmission of different types of data such text, audio, images, video and combination of these types of data at higher transmission rates. The Asynchronous Transfer Mode (ATM) has been widely accepted as transfer mode for B-ISDN. Traffic management and congestion control are main issues in ATM networks. In this paper, we desc...
متن کاملEffective Road Model for Congestion Control in VANETs
Congestion on the roads is a key problem to deal with, which wastes valuable time.. Due to high mobility rate and relative speed link failure occur very often. VANET is used to tackle the problem of congestion, and make decisions well in advance to avoid traffic congestion. In this paper we proposed a solution to detect and control the traffic congestion by using of both (V2V) and (V2I), as a r...
متن کاملFormal Verification of Congestion Control Algorithm in VANETs
A Vehicular Ad-Hoc Networks (VANETs) is the technology that uses moving cars as nodes in a network to create a mobile network. VANETs turn every participating car into a wireless router, allowing cars of each other to connect and create a network with a wide range. VANETs are developed for enhancing the driving safety and comfort of automotive users. The VANETs can provide wide variety of servi...
متن کاملCongestion Avoidance in Multi-Agent-based Egress Simulation
We focus on multi-agent-based egress simulation from large sports stadiums. We present the efficient Portal Clearinghouse algorithm for locating bottlenecks that are temporarily congested by agents. The purpose of this step is to allow agents who intend to use the congested portals to re-rout and avoid adding to existing congestions. We present simple heuristic techniques for other sub-problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Future Computer and Communication
سال: 2014
ISSN: 2010-3751
DOI: 10.7763/ijfcc.2014.v3.277